Conflicting Congestion Effects in Resource Allocation Games

نویسندگان

  • Michal Feldman
  • Tami Tamir
چکیده

We consider resource allocation games with heterogeneous users and identical resources. Most of the previous work considered cost structures with either negative or positive congestion effects. We study a cost structure that encompasses both the resource’s load and the job’s share in the resource’s activation cost. We consider the proportional sharing rule, where the resource’s activation cost is shared among its users proportionally to their lengths. We also challenge the assumption regarding the existence of a fixed set of resources, and consider settings with an unlimited supply of resources. We provide results with respect to equilibrium existence, computation, convergence and quality. We show that if the resource’s activation cost is shared equally among its users, a pure Nash equilibrium (NE) might not exist. In contrast, under the proportional sharing rule, a pure NE always exists, and can be computed in polynomial time. Yet, starting at an arbitrary profile of actions, best-response dynamics might not converge to a NE. Finally, we prove that the price of anarchy is unbounded and the price of stability is between 18/17 and 5/4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects

We study the model of resource allocation games with conflicting congestion effects that was introduced by Feldman and Tamir (2012). In this model, an agent’s cost consists of its resource’s load (which increases with congestion) and its share in the resource’s activation cost (which decreases with congestion). The current work studies the convergence rate of best-response dynamics (BRD) in the...

متن کامل

Price of Anarchy of Wireless Congestion Games

In this paper, we consider a resource allocation game with heterogenous players competing for limited resources. We model this as a singleton congestion game, where the share of each player is a decreasing function of the number of players selecting the same resource. In particular, we consider player-specific payoffs that depend not only on the shares of resource, but also on different prefere...

متن کامل

Resource Competition on Integral Polymatroids

We study competitive resource allocation problems in which players distribute their demands integrally on a set of resources subject to player-specific submodular capacity constraints. Each player has to pay for each unit of demand a cost that is a nondecreasing and convex function of the total allocation of that resource. This general model of resource allocation generalizes both singleton con...

متن کامل

طراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمان‌بندی در شبکه‌های بی‌سیم ad-hocبا در نظر‌گرفتن توان الکتریکی گره‌ها

Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...

متن کامل

COMS E 6998 : Algorithmic Game Theory and Economics Jan 27 , 2011 Lecture 2 – Congestion Games

Last week we looked at a global network connection game, and used the potential function method to show the existence of a global potential function and a pure equilibrium for that game. This week we will broaden our focus to the generalization of this game, which is the category of the Congestion Games. These games are of interest because they model many network, routing and resource allocatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2008